Recursion patterns and time-analysis
نویسندگان
چکیده
منابع مشابه
Polytypic Recursion Patterns
Recursive schemes over inductive data structures have been recognized as categorytheoretic universals, yielding a handful of equational laws for program construction and transformation. This paper introduces the implementation of such recursion patterns as type parametric, or polytypic, functionals in the Camila prototyping language. Several examples are discussed.
متن کاملPolymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time
The combination of parameter polymorphism, subtyping extended to qualified and polymorphic types, and polymorphic recursion is useful in standard type inference and gives expressive type-based program analyses, but raises difficult algorithmic problems. In a program analysis context we show how Mycroft’s iterative method of computing principal types for a type system with polymorphic recursion ...
متن کاملHigher type recursion, ramification and polynomial time
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a ramified type structure, and by adding linear concepts to the lambda calculus.
متن کاملLinear Time and Branching Time Semantics for Recursion with Merge
We consider two ways of assigning semantics to a class of statements built from a set of atomic actions (the 'alph.abe:'), by means of sequential composition, nondeterministic choice, recursion and merge (arbitmry interleaving). The first is linear time semantics (LT), stated in terms of trace theory; the semantic domain is the collection of all closed sets of finite and inftnite words. The sec...
متن کاملSpecification Patterns and Proofs for Recursion through the Store
Higher-order store means that code can be stored on the mutable heap that programs manipulate, and is the basis of flexible software that can be changed or re-configured at runtime. Specifying such programs is challenging because of recursion through the store, where new (mutual) recursions between code are set up on the fly. This paper presents a series of formal specification patterns that ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2005
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1071221.1071226